Reconfigurable Asymmetric Lightweight Cryptosystem
نویسندگان
چکیده
منابع مشابه
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform
Seven years after the optimal asymmetric encryption padding (OAEP) which makes chosen-ciphertext secure encryption scheme from any trapdoor one-way permutation (but whose unique application is RSA), this paper presents REACT, a new conversion which applies to any weakly secure cryptosystem, in the random oracle model: it is optimal from both the computational and the security points of view. In...
متن کاملA Networked, Lightweight and Partially Reconfigurable Platform
In this paper we present a networked lightweight and partially reconfigurable platform assisted by a remote bitstreams server. We propose a software and hardware architecture as well as a new data-link level network protocol implementation dedicated to dynamic and partial reconfiguration of FPGAs. It requires a network controller and much less external memories to store reconfiguration software...
متن کاملAn reconfigurable multiplier in GF(2m) for elliptic curve cryptosystem
In this paper an efficient architecture of a reconfigurable bit-serial polynomial hasis multiplier for Galois field GF(Z”’), where I<m= is proposed. The value of the field degree m can be changed and the irreducible polynomial can be configured and programmed. Comparing with previous designs, the advantages of.the proposed architecture are (i) the high order of flexibility, which allows an easy...
متن کاملA Fast Quantum-safe Asymmetric Cryptosystem Using Extra Superincreasing Sequences
This paper gives the definitions of an extra superincreasing sequence and an anomalous subset sum, and proposes a fast quantum-safe asymmetric cryptosystem called JUOAN2. The new cryptosystem is based on an additive multivariate permutation problem (AMPP) and an anomalous subset sum problem (ASSP) which parallel a multivariate polynomial problem and a shortest vector problem respectively, and c...
متن کاملQuantum Asymmetric-Key Cryptosystem Secure Against A Computationally Unbounded Adversary
In this paper we propose a quantum asymmetric-key cryptosystem, which does not rely on a computationally hard problem for security, but on uncertainty principles of quantum mechanics, thus obtaining security against a computationally unbounded adversary. We first propose a universally composable security criteria for quantum asymmetric-key cryptosystems by adapting the universally composable se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Emerging Trends in Engineering Research
سال: 2020
ISSN: 2347-3983
DOI: 10.30534/ijeter/2020/30852020